منابع مشابه
Solving Systems of Two-Sided (Max, Min)-Linear Equations
A finite iteration method for solving systems of (max, min)-linear equations is presented. The systems have variables on both sides of the equations. The algorithm has polynomial complexity and may be extended to wider classes of equations with a similar structure.
متن کاملExponential behaviour of the Butkovic-Zimmermann algorithm for solving two-sided linear systems in max-algebra
In [Butkovič and Zimmermann(2006)] an ingenious algorithm for solving systems of twosided linear equations in max-algebra was given and claimed to be strongly polynomial. However, in this note we give a sequence of examples showing exponential behaviour of the algorithm. We conclude that the problem of finding a strongly polynomial algorithm is still open.
متن کاملA strongly polynomial algorithm for solving two-sided linear systems in max-algebra
An algorithm for solving m× n systems of (max,+)-linear equations is presented. The systems have variables on both sides of the equations. After O(m4n4) iterations the algorithm either finds a solution of the system or finds out that no solution exists. Each iteration needs O(mn) operations so that the complexity of the presented algorithm is O(m5n5). © 2005 Elsevier B.V. All rights reserved.
متن کاملOptimization Problems Under One-sided (max,min)-Linear Equality Constraints
In this article we will consider optimization problems, the objective function of which is equal to the maximum of a finite number of continuous functions of one variable. The set of feasible solutions is described by the system of (max,min)-linear equality constraints with variables on one side. Complexity of the proposed method with monotone or unimodal functions will be studied, possible gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.06.011